Dynamic Min-Max Problems
نویسندگان
چکیده
A linear-system-theoretic view of discrete-event processes and its use for performance evaluation in manufacturing. 20 2. G t is a dominating subgraph of G c as there are no edges between nodes v i 2 V ? t and v j 2 (V + nV + t), G t has a min-max potential and G c has a min potential. G t is a maximal dominating subgraph of G c. To proof this, let us suppose that a subgraph G q of G c nG t could be moved to G t and the resulting partition is still dominating. In this case, G q must have a min-max potential with tight edges within G q only, see the proof of Corollary 11. Note that the periods corresponding to nodes v i in G q satisfy (v i) < max. Therefore, in going back to the quasi-periodic cycle graph the weight of edges in G q are increased and G q has no min-max potential according to Corollary 2 and Theorem 3. The following theorem summarizes the main result of the paper.
منابع مشابه
Approximation of min-max and min-max regret versions of some combinatorial optimization problems
This paper investigates, for the first time in the literature, the approximation of minmax (regret) versions of classical problems like shortest path, minimum spanning tree, and knapsack. For a constant number of scenarios, we establish fully polynomial-time approximation schemes for the min-max versions of these problems, using relationships between multi-objective and min-max optimization. Us...
متن کاملApproximation Complexity of min-max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack
This paper investigates, for the first time in the literature, the approximation of min-max (regret) versions of classical problems like shortest path, minimum spanning tree, and knapsack. For a bounded number of scenarios, we establish fully polynomial-time approximation schemes for the min-max versions of these problems, using relationships between multi-objective and min-max optimization. Us...
متن کاملRESOLUTION OF NONLINEAR OPTIMIZATION PROBLEMS SUBJECT TO BIPOLAR MAX-MIN FUZZY RELATION EQUATION CONSTRAINTS USING GENETIC ALGORITHM
This paper studies the nonlinear optimization problems subject to bipolar max-min fuzzy relation equation constraints. The feasible solution set of the problems is non-convex, in a general case. Therefore, conventional nonlinear optimization methods cannot be ideal for resolution of such problems. Hence, a Genetic Algorithm (GA) is proposed to find their optimal solution. This algorithm uses th...
متن کاملMax–Min Optimal Control of Constrained Discrete-time Systems
This paper considers the optimal control problem for constrained discrete–time systems affected by measured and bounded disturbances and uncertainties in the underlying system equations. This problem setting leads to the sup–inf robust optimal control problems. Three classes of discrete–time systems permitting the characterization of the sup–inf value functions and robust optimal control polici...
متن کاملMin-max and min-max (relative) regret approaches to representatives selection problem
The following optimization problem is studied. There are several sets of integer positive numbers whose values are uncertain. The problem is to select one representative of each set such that the sum of the selected numbers is minimum. The uncertainty is modeled by discrete and interval scenarios, and the min–max and min–max (relative) regret approaches are used for making a selection decision....
متن کاملRobust control of constrained max-plus-linear systems
SUMMARY Max-plus-linear (MPL) systems are a class of nonlinear systems that can be described by models that are " linear " in the max-plus algebra. We provide here solutions to three types of finite-horizon min-max control problems for uncertain MPL systems, depending on the nature of the control input over which we optimize: open-loop input sequences, disturbances feedback policies, and state ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997